#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
LL c[maxn];
void dfs(LL l,LL r,LL num){
    if(l>r) return;
    LL pos=0;
    for(LL i=l;i<=r;i++){
        if(a[i]>a[pos]) pos=i;
    }
    c[pos]=num;
    dfs(l,pos-1,num+1);
    dfs(pos+1,r,num+1);
}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL n;cin>>n;
    for(LL i=1;i<=n;i++){
        cin>>a[i];
    }
    dfs(1,n,0);
    for(LL i=1;i<=n;i++){
        cout<<c[i]<<" ";
    }
    cout<<"\n";
  }
return 0;
}
